The Centroid Decomposition: Relationships between Discrete Variational Decompositions and SVDs
نویسندگان
چکیده
The centroid decomposition, an approximation for the singular value decomposition (SVD), has a long history among the statistics/psychometrics community for factor analysis research. We revisit the centroid method in its original context of factor analysis and then adapt it to other than a covariance matrix. The centroid method can be cast as an O(n)-step ascent method on a hypercube. It is shown empirically that the centroid decomposition provides a measurement of second order statistical information of the original data in the direction of the corresponding left centroid vectors. One major purpose of this work is to show fundamental relationships between the singular value, centroid, and semidiscrete decompositions. This unifies an entire class of truncated SVD approximations. Applications include semantic indexing in information retrieval.
منابع مشابه
The Centroid Decomposition: Relationships between Discrete Variational Decompositions and Svd
The centroid decomposition, an approximation for the singular value decomposition, had a long history among the statistics/psychometrics community for factor analysis research. We revisit the centroid method first in its original context of factor analysis and then adapt it to other than a covariance matrix. The centroid method can be cast as an O(n)-step ascent method on a hypercube. It is sho...
متن کاملUses of the Singular Value Decompositions in Biology
The Singular Value Decomposition is a very useful tool deeply rooted in linear algebra. Despite this, SVDs have found their way into many different areas of biology. Biological datasets, often large and noisy, lend themselves to the analysis SVDs offer. While the biological interpretation can be difficult, and the linear algebra can be overwhelming, the utility of the decomposition is making it...
متن کاملTarski Number and Configuration Equations
The concept of configuration of groups which is defined in terms of finite partitions and finite strings of elements of the group is presented by Rosenblatt and Willis. To each set of configurations, a finite system of equations known as configuration equations, is associated. Rosenblatt and Willis proved that a discrete group G is amenable if and only if every possible instance of its configur...
متن کاملA note on polar decomposition based Geršgorin-type sets
Abstract: Let B ∈ Cn×n denote a finite-dimensional square complex matrix. In [6] and [7], Professor Varga and I introduced Geršgorin-type sets which were developed from Singular Value Decompositions (SVDs) of B. In this note, our work is extended by introducing the polar SV-Geršgorin set, Γ(B). The set Γ(B) is a union of n closed discs in C, whose centers and radii are defined in terms of the e...
متن کاملNew Robust Stability Criteria for Uncertain Neutral Time-Delay Systems With Discrete and Distributed Delays
In this study, delay-dependent robust stability problem is investigated for uncertain neutral systems with discrete and distributed delays. By constructing an augmented Lyapunov-Krasovskii functional involving triple integral terms and taking into account the relationships between the different delays, new less conservative stability and robust stability criteria are established first using the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 23 شماره
صفحات -
تاریخ انتشار 2002